Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions
نویسندگان
چکیده
Due to the widespread adoption of locationbased services and other spatial applications, data warehouses that store spatial information are becoming increasingly prevalent. Consequently, it is becoming important to extend the standard OLAP paradigm with features that support spatial analysis and aggregation. While traditional OLAP systems are limited to data characterized by strictly categorical feature dimensions, Spatial OLAP systems must provide support for both categorical and spatial feature dimensions. Such spatial feature dimensions are typically represented by continuous data values. In this paper we propose a technique for representing and indexing relational OLAP views with mixed categorical and continuous data. Our method builds on top of an established mechanism for standard OLAP and exploits characteristic properties of space-filling curves. It allows us to effectively represent and index mixed categorical and continuous data, while dynamically adapting to changes in dimension cardinality during updates. We have implemented the proposed storage and indexing methods and evaluated their build, update, and query times using both synthetic and real datasets. Our experiments show that the proposed methods based on Hilbert curves of dynamic resolutions offers significant performance advantages especially for view updates.
منابع مشابه
CUBIST: A New Approach to Speeding Up OLAP Queries
We report on a new, efficient encoding for the data cube, which results in a drastic speed-up of OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes. Specifically, we introduce a new data structure, called Statistics Tree (ST), together with an algorithm, called CubiST (Cubing with Statistics Trees), for evaluating OLAP queries on top of a r...
متن کاملParallel Multi-Dimensional RolaP Indexing1
This article addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present RCUBE, a distributed multidimensional ROLAP indexing scheme which is practical to implement, requires only a small communication volume, and is fully adapted to distributed disks. Our solution is efficient for spatial searches in high dimensions and scalable in terms of data sizes, dimensions, a...
متن کاملRCUBE: Parallel Multi-Dimensional ROLAP Indexing
This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present RCUBE, a distributed multi-dimensional ROLAP indexing scheme which is practical to implement, requires only a small communication volume, and is fully adapted to distributed disks. Our solution is efficient for spatial searches in high dimensions and scalable in terms of data sizes, dimensions, an...
متن کاملParallel Multi-Dimensional ROLAP Indexing
This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexing scheme which is practical to implement, requires only a small communication volume, and is fully adapted to distributed disks. Our solution is efficient for spatial searches in high dimensions and scalable in terms of data sizes, dimensions, and numbe...
متن کاملInteractive ROLAP on Large Datasets: A Case Study with UB-Trees
Online Analytical Processing (OLAP) requires query response times within the range of a few seconds in order to allow for interactive drilling, slicing, or dicing through an OLAP cube. While small OLAP applications use multidimensional database systems, large OLAP applications like the SAP BW rely on relational (ROLAP) databases for efficient data storage and retrieval. ROLAP databases use spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JDIM
دوره 5 شماره
صفحات -
تاریخ انتشار 2007